The Impact of Workload Variability on Load Balancing Algorithms

نویسندگان

  • Marta Beltrán
  • Antonio Guzmán
چکیده

The workload on a cluster system can be highly variable, increasing the difficulty of balancing the load across its nodes. The general rule is that high variability leads to wrong load balancing decisions taken with out-of-date information and difficult to correct in real-time during applications execution. In this work the workload variability is studied from the perspective of the load balancing performance, focusing on the design of algorithms capable of dealing with this variability. In this paper an exhaustive analysis is presented to help users and administrators to understand if their load balancing mechanisms are sensitive to variability and to what degree. Furthermore, solutions to deal with variability in load balancing algorithms are proposed and their utilization is exemplified on a real load balancing algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cycle Time Reduction and Runtime Rebalancing by Reallocating Dependent Tasks

Business Process Management Systems (BPMS) is a complex information system that provides designing, administrating, and improving the business processes. Task allocation to human resources is one of the most important issues which should be managed more efficiently in BPMS. Task allocation algorithms are defined in order to meet the various policies of organizations. The most important of these...

متن کامل

Load Balancing to Save Energy in Cloud Computing

While load balancing techniques have been designed and evaluated for efficient resource utilization in cloud computing, achieving energy efficiency as a consequence of load balancing often does not get direct attention. In this paper we describe two load balancing algorithms that focus on balancing workload distribution among physical hosts in the cloud infrastructure. The test results presente...

متن کامل

Passive/Active Load Balancing with Informed Node Placement in DHTs

Distributed key/value stores are a basic building block for large-scale Internet services. Support for range queries introduces new challenges to load balancing since both the key and workload distribution can be non-uniform. We build on previous work based on the power of choice to present algorithms suitable for active and passive load balancing that adapt to both the key and workload distrib...

متن کامل

Performance Analysis of Load Balancing Algorithms

Load balancing is the process of improving the performance of a parallel and distributed system through a redistribution of load among the processors [1] [5]. In this paper we present the performance analysis of various load balancing algorithms based on different parameters, considering two typical load balancing approaches static and dynamic. The analysis indicates that static and dynamic bot...

متن کامل

On Choosing a Load-Balancing Algorithm for Parallel Systems with Temporal Constraints

A key point in parallel systems design is the way clients requests are forwarded and distributed among the servers, trying to obtain the maximum throughput from them or, in other words, the load-balancing policy. Although it is a largely studied theme, with well accepted solutions, the inclusion of temporal constraints, also denoted as deadlines in this work, to the requests brings new complexi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Scalable Computing: Practice and Experience

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2009